#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"
using PII = pair<int, int>;
using TII = tuple<int, int, int>;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define BSI basic_string<int>
#define BSPI basic_string<PII>
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define VI vector<int>
#define VII vector<vector<int>>
#define VPII vector<PII>
#define lowbit(x) ((x)&(-x))
#define RE return;
#define RET return true;
#define REF return false;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define fi first
#define se second
#define sz size()
constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;

int __FAST_IO__ = [](){
    ios::sync_with_stdio(0), cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12);
    return 0;
}();

int n,c;
struct E{
    string a;
    int x;
    bool operator<(const E& t)const{
        return x>t.x;
    }
}w[N];
int cnt[N*10];

void solve() {
    cin>>n>>c;

    priority_queue<pair<int,string>>q;

    map<string,int>pos;

    FOR(i,1,n){
        string a;
        int x;
        cin>>a>>x;
        w[i]={a,x};
        pos[a]=i;
        q.push({x,a});
    }

    map<int,int>mp;
    
    int tot=0;
    while(q.sz){
        auto [x,a]=q.top();
        q.pop();

        mp[pos[a]]++;

        if(x>=c){
            cnt[++tot]=0;
            x-=c;
            if(x)q.push({x,a});
        }else{
            bool f=false;
            FOR(i,1,tot){
                if(cnt[i]>=x){
                    cnt[i]-=x;
                    f=1;
                    break;
                }
            }
            if(!f){
                cnt[++tot]=c-x;
            }
        }
    }


    FOR(i,1,n){
        cout<<w[i].a<<' '<<mp[pos[w[i].a]]<<endl;
    }

    cout<<tot<<endl;

}

signed main() {
    int Task = 1;
    for (; Task; Task--) {
        solve();
    }
    return 0;
}